Meanders of rheumatology

Cutting Degree of Meanders

We study the cutting problems of meanders using 2-Motzkin words. These words uniquely define elevated peakless Motzkin paths, which under specific conditions correspond to meanders. A procedure for the determination of the set of meanders with a given sequence of cutting degrees, or with a given cutting degree, is presented by using proper conditions.

Enumerations of plane meanders

A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...

Stamp Foldings, Semi-Meanders, and Open Meanders: Fast Generation Algorithms

By considering a permutation representation for stamp-foldings and semi-meanders we construct tree-like data structures that will allow us to generate these objects in constant amortized time. Additionally, by maintaining the wind-factor and applying an additional optimization, the algorithm for semi-meanders can be modified to produce the fastest known algorithm to generate open meanders.

Meanders and Motzkin Words

River Restoration and Meanders

Among the most visually striking river restoration projects are those that involve the creation of a new channel, often in a new alignment and generally with a form and dimensions that are different from those of the preproject channel. These channel reconstruction projects often have the objective of creating a stable, single-thread, meandering channel, even on rivers that were not historicall...